An Educational Tool For Teaching Simulated Annealing And Placement

نویسندگان

  • Tania Mara Ferla
  • Guilherme Flach
  • Ricardo Reis
چکیده

This paper presents an educational tool which can be used for teaching the Simulated Annealing (SA) algorithm. The SA is applied to solve integrated circuit placement. SA is an effective method to solve NPcomplete problems as circuit placement. The interface developed in this work provides a visualization of the execution steps of the SA, which makes the tool more iterative and didactic. The tool is developed using web standards (HTML 5, CSS and JavaScript) and hence it is accessible across multiple platforms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Blue Macaw: A Didactic Placement Tool Using Simulated Annealing

This paper presents a didactic Simulated Annealing placement tool. Simulated Annealing is a very famous generic combinatorial optimization algorithm that has been successfully applied to VLSI placement. Our tool allows any user to change several parameters of the algorithm and see their implications in the results graphically. At every algorithm step, the current placement disposition is displa...

متن کامل

A Routing-Aware Simulated Annealing-based Placement Method in Wireless Network on Chips

Wireless network on chip (WiNoC) is one of the promising on-chip interconnection networks for on-chip system architectures. In addition to wired links, these architectures also use wireless links. Using these wireless links makes packets reach destination nodes faster and with less power consumption. These wireless links are provided by wireless interfaces in wireless routers. The WiNoC archite...

متن کامل

Simulated Annealing Approach for Solving Bilevel Programming Problem

Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...

متن کامل

Simulated Annealing Approach for Solving Bilevel Programming Problem

Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...

متن کامل

An evaluation of parallel simulated annealing strategies with application to standard cell placement

Simulated annealing, a methodology for solving combinatorial optimization problems, is a very computationally expensive algorithm, and as such, numerous researchers have undertaken efforts to parallelize it. In this paper, we investigate three of these parallel simulated annealing strategies when applied to standard cell placement, specifically the TimberWolfSC placement tool. We have examined ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012